Dual potentials for capacity constrained optimal transport
نویسندگان
چکیده
منابع مشابه
Dual potentials for capacity constrained optimal transport
Optimal transportation with capacity constraints, a variant of the well-known optimal transportation problem, is concerned with transporting one probability density f ∈ L1(Rm) onto another one g ∈ L1(Rn) so as to optimize a cost function c ∈ L1(Rm+n) while respecting the capacity constraints 0 ≤ h ≤ h̄ ∈ L∞(Rm+n). A linear programming duality theorem for this problem was first established by Lev...
متن کاملDual measures for capacity constrained optimal transport∗
This note addresses the transport of one probability density f ∈ L1(Rm) onto another one g ∈ L1(Rn) so as to optimize a cost function c ∈ L1(Rm+n) while respecting the capacity constraints 0 ≤ h ≤ h̄ ∈ L∞(Rm+n). If f, g and h̄ are continuous, compactly supported, and bounded away from zero on their supports, and if the problem remains feasible when h̄ is replaced by h̄ − for some > 0, we characteri...
متن کاملInsights into capacity-constrained optimal transport.
A variant of the classical optimal transportation problem is the following: among all joint measures with fixed marginals and that are dominated by a given density, find the optimal one. Existence and uniqueness of solutions to this variant were established by Korman and McCann. In the present article, we expose an unexpected symmetry leading to explicit examples in two and more dimensions. The...
متن کاملPrimal - dual Strategy for Constrained Optimal
An algorithm for eecient solution of control constrained optimal control problems is proposed and analyzed. It is based on an active set strategy involving primal as well as dual variables. For discretized problems suucient conditions for convergence in nitely many iterations are given. Numerical examples are given and the role of strict complementarity condition is discussed. 1. Introduction a...
متن کاملNear-Optimal Algorithms for Capacity Constrained Assortment Optimization
Assortment optimization is an important problem that arises in many practical applications such as retailing and online advertising. In an assortment optimization problem, the goal is to select a subset of items that maximizes the expected revenue in the presence of the substitution behavior of consumers specified by a choice model. In this paper, we consider the capacity constrained version of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Calculus of Variations and Partial Differential Equations
سال: 2014
ISSN: 0944-2669,1432-0835
DOI: 10.1007/s00526-014-0795-9